منابع مشابه
On Using Tabu Search for RNA Secondary Structure Prediction
In this article, a novel approach is proposed to predict RNA secondary structure called RNA secondary structure prediction based on Tabu Search (RNATS). In the RNATS algorithm, two search models, intensification search and diversification search, are developed to exploit the local regions around the current solution and explore the unvisited solution space, respectively. Simulation experiments ...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملTABU search
This article explores the meta-heuristic approach called tabu search, which is dramatically changing our ability to solve a host of problems in applied science, business and engineering. Tabu search has important links to evolutionary and “genetic” methods, often overlooked, through its intimate connection with scatter search and path relinking — evolutionary procedures that have recently attra...
متن کاملPerformance Driven Placement Using Tabu Search
Abstrllct. In this paper. we present an effective performance driven placement with glohal routing algorithm for macro cells. Our algorithm uses a hierarchical. divide and conquer, quad-partitioning approach. 'nle quad-partitioning routine uses the Tahu Search technique. Our algorithm uses the concept of proximity of regiuns tu approximate Ille interconnection delays during the placement proces...
متن کاملEfficient optimisation of structures using tabu search
This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2006
ISSN: 1748-7188
DOI: 10.1186/1748-7188-1-20